Generalized Memory Manipulating Actions for Parsing Natural Language
نویسندگان
چکیده
Current (computational) linguistic theories have developed specific fos'malisllls for representing linguistic phenomena such as unbounded dependencies, relatives, etc, In this contribution we present a model el linguistic structures storing and accessing, which accounts for the same phenomena in a procedural way. Such a model has been implemented in the frame of an ATN parser.
منابع مشابه
An Efficient Parser Generator for Natural Language
We. have developed a parser generator for natural language i)rocessing. The generator named "NLyace" accepts g rammar rules written in the Yacc format . NLyacc, unlike Yacc, can handle a rb i t ra ry context-free grammars using the generalized Lll. parsing Mgorithm. The parser produced by NLyacc elliciently parses given sentences and executes semantic actions. NLyacc, which is a free and sharab...
متن کاملA New Parallel Algorithm for Generalized LR Parsing
Tomita's parsing algorithm [~Ibmita 86], which adapted the LR parsing algorithm to context fl'ee grammars, makes use of a breadth-first strategy to handle LR table conflicts. As the breadth-first strategy is compatible with parallel processing, we can easily develop a parallel generalized LR parser b~ed on Tomita's algorithm [Tanaka 89]. However, there is a problem in that this algorithm synchr...
متن کاملAn improved joint model: POS tagging and dependency parsing
Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...
متن کاملDisambiguation Filters for Scannerless Generalized LR Parsers
Several real-world problems call for more parsing power than is offered by the widely used and well-established deterministic parsing techniques. These techniques also create an artificial divide between lexical and context-free analysis phases, at the cost of significant complexity at their interface. In this paper we present the fusion of generalized LR parsing and scannerless parsing. This c...
متن کاملA Parallel Augmented Context-Free Parsing System For Natural Language Analysis
Parsing efficiency is one of the important issues in building practical natural language processing systems. This paper proposes a design and an implementation of a parallel augmented context-free parsing system for natural language analysis. Natural language grammars are more than context-free, so that unification formalisms are adopted to enforce the linguistic constraints and to transfer the...
متن کامل